Algorithm on the convex hull of a simple polygon 簡(jiǎn)單多邊形凸包的算法
The algorithm for convex hull set of plane finite point set 平面有限點(diǎn)集最小凸包集的計(jì)算方法
The convex hull of sbgb and subdivision algorithms are also discussed 此外,還討論了sbgb曲線的包絡(luò)及細(xì)分算法。
Absolute convex hulls 絕對(duì)凸包
And its convex hull 及其凸包
This article researches mostly on how to improve the convex hull algorithm of planar point set 本文的主要內(nèi)容是對(duì)凸包的算法進(jìn)行改進(jìn)。
Instead of constructing a convex hull, we could construct a bounding box around the solid 如果不建立凸殼,我們可以在物體附近建立一個(gè)范圍框。
An easy approach is to create a convex hull around an object's location at two different times 一條簡(jiǎn)單的途徑就是在2不同的時(shí)間在一個(gè)物體的地點(diǎn)附近創(chuàng)造凸殼。
Abstract an improved image recognition and registration algorithm based on convex hull and affine invariant was presented 摘要提出了一種新的基于凸殼和仿射不變量的圖像識(shí)別和配準(zhǔn)的方法。
In this paper, application of convex hull is proposed to slove the problem of global tool interference avoidance in 5-axis sculptured surface machining 本文提出了運(yùn)用凸包法解決在五軸加工中刀具干涉的算法。